1062D - Fun with Integers - CodeForces Solution


dfs and similar graphs implementation math *1800

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
long long n;
long long ans;
int main()
{
	cin>>n;
	for(int i=2;i<=n;i++)
		for(int j=i+i;j<=n;j+=i)
			ans+=j/i;
	cout<<ans*4;
	return 0;
}
	  			 						    			 			 					


Comments

Submit
0 Comments
More Questions

1716A - 2-3 Moves
1670B - Dorms War
1716B - Permutation Chain
987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft
1562A - The Miracle and the Sleeper
1216A - Prefixes
1490C - Sum of Cubes
868A - Bark to Unlock
873B - Balanced Substring
1401D - Maximum Distributed Tree
1716C - Robot in a Hallway
1688B - Patchouli's Magical Talisman
99A - Help Far Away Kingdom
622B - The Time
1688C - Manipulating History
1169D - Good Triple